- algorithm for the inversion
- алгоритм инверсии
Англо-русский словарь по вычислительной технике и информационным технологиям - 4-е изд.. Сергей Орлов .
algorithm for the inversion
Смотреть что такое "algorithm for the inversion" в других словарях:
The Well-Tempered Clavier — Title page of Das Wohltemperierte Clavier[1] The Well Tempered Clavier (German: Das Wohltemperierte Klavier),[2] BWV 846–893, is a collection of solo keyboard music composed by Johann Sebastian Bach. He … Wikipedia
Itoh-Tsujii inversion algorithm — The Itoh Tsujii inversion algorithm is used to invert elements in a finite field. It was introduced in 1988 and first used over GF(2 m ) using the normal basis representation of elements, however the algorithm is generic and can be used for other … Wikipedia
Μ-law algorithm — The µ law algorithm (pronounced myoo law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. As with other companding algorithms, its purpose is to reduce the dynamic range of an audio… … Wikipedia
Criticism of the APL programming language — The APL programming language has been used since the mid 1960s on mainframe computers and has itself evolved in step with computers and the computing market. APL is not widely used, but minimalistic and high level by design, at several points in… … Wikipedia
Genetic algorithm — A genetic algorithm (GA) is a search heuristic that mimics the process of natural evolution. This heuristic is routinely used to generate useful solutions to optimization and search problems. Genetic algorithms belong to the larger class of… … Wikipedia
Floyd–Warshall algorithm — In computer science, the Floyd–Warshall algorithm (sometimes known as the WFI Algorithm or Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed… … Wikipedia
Strassen algorithm — In the mathematical discipline of linear algebra, the Strassen algorithm, named after Volker Strassen, is an algorithm used for matrix multiplication. It is asymptotically faster than the standard matrix multiplication algorithm, but slower than… … Wikipedia
μ-law algorithm — Companding of μ law and A law algorithms The µ law algorithm (often u law, ulaw, or mu law) is a companding algorithm, primarily used in the digital telecommunication systems of North America and Japan. Companding algorithms reduce the dynamic… … Wikipedia
Software choice for discrete event simulations — Tools for discrete event simulationsDiscrete event simulations may be written in any general purpose computer language such as C++ but to construct an industry grade project in reasonable time with a general computing language consumes too much… … Wikipedia
Non-blocking algorithm — In computer science, a non blocking algorithm ensures that threads competing for a shared resource do not have their execution indefinitely postponed by mutual exclusion. A non blocking algorithm is lock free if there is guaranteed system wide… … Wikipedia
Levinson recursion — or Levinson Durbin recursion is a procedure in linear algebra to recursively calculate the solution to an equation involving a Toeplitz matrix. The algorithm runs in Θ(n2) time, which is a strong improvement over Gauss Jordan elimination, which… … Wikipedia
